An Automatic Marking System for Interactive Exercises on Blind Search Algorithms
نویسندگان
چکیده
In this paper, we present a web-based automatic marking system that aims to assist the tutor in assessing the performance of students in interactive exercises related to breadth-first search (BFS) and depth-first search (DFS) algorithms. The system has been tested on a number exercises for BFS and DFS search algorithms and its performance has been compared against that of an expert tutor. The experimental results are quite promising.
منابع مشابه
Optimizing the AGC system of a three-unequal-area hydrothermal system based on evolutionary algorithms
This paper focuses on expanding and evaluating an automatic generation control (AGC) system of a hydrothermal system by modelling the appropriate generation rate constraints to operate practically in an economic manner. The hydro area is considered with an electric governor and the thermal area is modelled with a reheat turbine. Furthermore, the integral controllers and electri...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملACES: an interactive software platform for self-instruction and self-evaluation in automatic control systems
This work presents an interactive-, menu-driven prototype software platform, namely Automatic Control Educational Software (ACES), for self-instruction and selfevaluation in automatic control systems. ACES is used for enriching instruction in automatic control at Aristotle University of Thessaloniki, Greece in the Department of Electrical and Computer Engineering. The ACES platform includes t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013